algebra methods for the Minimal Resolution Conjecture

نویسندگان

  • David Eisenbud
  • Sorin Popescu
  • Frank-Olaf Schreyer
  • Charles Walter
چکیده

If r ≥ 6, r 6= 9, we show that the Minimal Resolution Conjecture fails for a general set of γ points in P for almost 12 √ r values of γ. This strengthens the result of Eisenbud and Popescu [1999], who found a unique such γ for each r in the given range. Our proof begins like a variation of that of Eisenbud and Popescu, but uses exterior algebra methods as explained by Eisenbud and Schreyer [2000] to avoid the degeneration arguments that were the most difficult part of the EisenbudPopescu proof. Analogous techniques show that the Minimal Resolution Conjecture fails for linearly normal curves of degree d and genus g when d ≥ 3g − 2, g ≥ 4, reproving results of Schreyer, Green, and Lazarsfeld.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 Exterior algebra methods for the Minimal Resolution Conjecture

If r ≥ 6, r = 9, we show that the Minimal Resolution Conjecture fails for a general set of γ points in P r for almost 1 2 √ r values of γ. This strengthens the result of Eisenbud and Popescu [1999], who found a unique such γ for each r in the given range. Our proof begins like a variation of that of Eisenbud and Popescu, but uses exterior algebra methods as explained by Eisenbud and Schreyer [2...

متن کامل

Minimal Resolution of Relatively Compressed Level Algebras

A relatively compressed algebra with given socle degrees is an Artinian quotient A of a given graded algebra R/c, whose Hilbert function is maximal among such quotients with the given socle degrees. For us c is usually a “general” complete intersection and we usually require that A be level. The precise value of the Hilbert function of a relatively compressed algebra is open, and we show that f...

متن کامل

Exterior Algebra Methods for the Minimal Resolution Conjecture

If r ≥ 6, r 6= 9, we show that the minimal resolution conjecture (MRC) fails for a general set of γ points in Pr for almost (1/2) √ r values of γ . This strengthens the result of D. Eisenbud and S. Popescu [EP1], who found a unique such γ for each r in the given range. Our proof begins like a variation of that of Eisenbud and Popescu, but uses exterior algebra methods as explained by Eisenbud, ...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Minimal Projective Resolutions

In this paper, we present an algorithmic method for computing a projective resolution of a module over an algebra over a field. If the algebra is finite dimensional, and the module is finitely generated, we have a computational way of obtaining a minimal projective resolution, maps included. This resolution turns out to be a graded resolution if our algebra and module are graded. We apply this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000